A Uniform Approach to Processing Temporal Queries
نویسندگان
چکیده
Research in temporal databases has mainly focused on defining temporal data models by extending existing models, and developing access structures for temporal data. Little has been done on temporal query processing and optimization. In this paper, we propose a uniform framework for processing temporal queries, which builds upon well-understood techniques for processing non-temporal queries. We start with an object-oriented model, and rely on its rich type system to model complex temporal information. The same query language is used to express temporal and non-temporal queries uniformly. A major benefit to this approach is that temporal query processing can be smoothly extended from an existing (non-temporal) query processing framework. For the purpose of query processing, we describe an object algebra, into which queries are compiled. Since the object algebra resembles the relational algebra, familiar relational query optimization techniques can be used. However, since the physical representation of temporal data and access methods differ from those of nontemporal data, new algorithms must be developed to evaluate the algebraic operators. We demonstrate that temporal queries can be processed and optimized under the existing query processing framework.
منابع مشابه
Mixed Qualitative/Quantitative Dynamic Simulation of Processing Systems
In this article the methodology proposed by Li and Wang for mixed qualitative and quantitative modeling and simulation of temporal behavior of processing unit is reexamined and extended to more complex case. The main issue of their approach considers the multivariate statistics of principal component analysis (PCA), along with clustered fuzzy digraphs and reasoning. The PCA and fuz...
متن کاملارائه روشی پویا جهت پاسخ به پرسوجوهای پیوسته تجمّعی اقتضایی
Data Streams are infinite, fast, time-stamp data elements which are received explosively. Generally, these elements need to be processed in an online, real-time way. So, algorithms to process data streams and answer queries on these streams are mostly one-pass. The execution of such algorithms has some challenges such as memory limitation, scheduling, and accuracy of answers. They will be more ...
متن کاملCoherent spherical range-search for dynamic points on GPUs
We present an approach to accelerate spherical range-search (SRS) for dynamic points that employs the computational power of many-core GPUs. Unlike finding k approximate nearest neighbours (ANNs), exact SRS is needed in geometry processing and physical simulation to avoid missing small features. The spatial coherence of query points and the temporal coherence of dynamic points are exploited in ...
متن کاملFirst-Order Queries over Temporal Databases Inexpressible in Temporal Logic
Queries over temporal databases involve references to time. We study diierences between two approaches of including such references into a rst-order query language (e.g., relational calculus): explicit (using typed variables and quantiiers) vs. implicit (using a nite set of modal connectives). We also show that though the latter approach|a rst-order query language with implicit references to ti...
متن کاملAn Effective Path-aware Approach for Keyword Search over Data Graphs
Abstract—Keyword Search is known as a user-friendly alternative for structured languages to retrieve information from graph-structured data. Efficient retrieving of relevant answers to a keyword query and effective ranking of these answers according to their relevance are two main challenges in the keyword search over graph-structured data. In this paper, a novel scoring function is proposed, w...
متن کامل